Constrained global optimization for wine blending
نویسندگان
چکیده
منابع مشابه
A New Hybrid Flower Pollination Algorithm for Solving Constrained Global Optimization Problems
Global optimization methods play an important role to solve many real-world problems. Flower pollination algorithm (FP) is a new nature-inspired algorithm, based on the characteristics of flowering plants. In this paper, a new hybrid optimization method called hybrid flower pollination algorithm (FPPSO) is proposed. The method combines the standard flower pollination algorithm (FP) with the par...
متن کاملTopographical Global Optimization for Constrained Problems
In topographical global optimization a sample of points that superuniformly cover the region of interest, A, is used in combination with the function evaluations in these points to obtain a topographical graph of A from which candidate points are easily extracted for local minimizations. This paper discusses some of the problems in obtaining such a cover and presents some solutions. These solut...
متن کاملConstrained Efficient Global Optimization for Pultrusion Process
Composite materials, as the name indicates, are composed of different materials which yield superior performance as compared to individual components. Pultrusion is one of the most costeffective manufacturing techniques for producing fiber reinforced composites with constant cross sectional profiles. This obviously makes it more attractive for both researchers and practitioners to investigate t...
متن کاملEfficient interval partitioning for constrained global optimization
1 Nanyang Technological University, School of Mechanical and Aerospace Engineering, Singapore, 2 New England Biolabs Inc., 240 County Road, Ipswich, MA [email protected] 3 Izmir Ekonomi Universitesi, Izmir, Turkey [email protected] 4 University of Szeged, Institute of Informatics, Szeged, Hungary [email protected] 5 Advanced Concepts Team, ESA/ESTEC, Noordwijk, The Netherlands Tam...
متن کاملSimulated annealing for constrained global optimization
Hide-and-Seek is a powerful yet simple and easily implemented continuous simulated annealing algorithm for finding the maximum of a continuous function over an arbitrary closed, bounded and full-dimensional body. The function may be nondifferentiable and the feasible region may be noneonvex or even disconnected. The algorithm begins with any feasible interior point. In each iteration it generat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Constraints
سال: 2015
ISSN: 1383-7133,1572-9354
DOI: 10.1007/s10601-015-9235-5